Durational Actions Timed Automata: Determinization and Expressiveness
نویسندگان
چکیده
منابع مشابه
Durational Actions Timed Automata: Determinization and Expressiveness
In this paper we present durational actions timed automata, DATA*, as a sub class of timed automata. In the contrast of T.A, the underling semantic of DATA* is the maximality semantics which claim that actions have durations and true concurrency is captured differently from choice. DATA* model is in one hand useful for modeling and validating reel aspects of systems. In the other hand, it is de...
متن کاملA Graph Grammar Approach for Durational Action Timed Automata Determinization
Durational Action Timed Automata (DATA) is a semantic model for expressing the behavior of real time systems where actions have durations. In this paper, we propose an approach for translating a DATA structure to a corresponding deterministic one. For this purpose, a meta-model of DATA model and a transformation grammar are defined. Programs are written in Python language and implemented under ...
متن کاملExpressiveness of Updatable Timed Automata
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...
متن کاملTrace Expressiveness of Timed and Probabilistic Automata
Automata expressiveness is an essential feature in understanding which of the formalisms available should be chosen for modelling a particular problem. Probabilistic and stochastic automata are suitable for modelling systems exhibiting probabilistic behaviour and their expressiveness has been studied relative to non-probabilistic transition systems and Markov chains. In this paper, we consider ...
متن کاملTemporal Logic + Timed Automata : Expressiveness and
We investigate the veriication problem of timed automata w.r.t. linear-time dense time temporal logics. We propose a real-time logic TATL which extends the propositional temporal logic with constraints involving timed automata. These constraints allow to require that the computation segment since some designated point is accepted by a given timed automaton. We identify an expressively powerful ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Information Systems
سال: 2012
ISSN: 2249-0868
DOI: 10.5120/ijais12-450609